A smooth penalty-based sample average approximation method for stochastic complementarity problems
نویسندگان
چکیده
منابع مشابه
Sample Average Approximation Method for Compound Stochastic Optimization Problems
The paper studies stochastic optimization (programming) problems with compound functions containing expectations and extreme values of other random functions as arguments. Compound functions arise in various applications. A typical example is a variance function of nonlinear outcomes. Other examples include stochastic minimax problems, econometric models with latent variables, multi-level and m...
متن کاملA smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure
This paper is concerned with solving single CVaR and mixed CVaR minimization problems. A CHKS-type smoothing sample average approximation (SAA) method is proposed for solving these two problems, which retains the convexity and smoothness of the original problem and is easy to implement. For any fixed smoothing constant 2, this method produces a sequence whose cluster points are weak stationary ...
متن کاملThe Sample Average Approximation Method for 2-stage Stochastic Optimization
We consider the Sample Average Approximation (SAA) method for 2-stage stochastic optimization problems with recourse and prove a polynomial time convergence theorem for the SAA method. In the 2-stage recourse model, where one makes decisions in two steps. First, given only distributional information about (some of) the data, one commits on initial (first-stage) actions, and then once the actual...
متن کاملSample average approximation method for a class of stochastic variational inequality problems
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existence and convergence of a solution to the sample average approximated SVIP. Under some moderate conditions, we show that the sample average approximated SVIP has a solution with probability one and with probability approa...
متن کاملThe Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation–based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and the expected value function is approximated by the corresponding sample average function. The obtained sample average optimization problem is solved, and the procedure is repeated several times until a stopping crite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2015
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.03.017